Complexity of regular functions

Complexity of Regular Functions

We give complexity bounds for various classes of functions computed by cost register automata.

Register Complexity of Additive Regular Functions

Additive Cost Register Automata (ACRA) map strings to integers using a finite set of registers that are updated using assignments of the form “x := y + c” at every step. The corresponding class of additive regular functions has multiple equivalent characterizations, appealing closure properties, and decidable analysis questions. In this paper, we define the register complexity of an additive re...

the effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing

بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...

Partial second-order subdifferentials of -prox-regular functions

Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2  functions. The class of prox-regular functions covers all convex functions, lower C2  functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...

Combinatorial Complexity of Regular Languages